Bernstein sets andκ-coverings

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bernstein Sets with Algebraic Properties

We construct Bernstein sets in R having some additional algebraic properties. In particular, solving a problem of Kraszewski, RaÃlowski, Szczepaniak and Żeberski, we construct a Bernstein set which is a < c-covering and improve some other results of RaÃlowski, Szczepaniak and Żeberski on nonmea-

متن کامل

New coverings of t-sets with (t + 1)-sets

The minimum number of k-subsets out of a v-set such that each t-set is contained in at least one k-set is denoted by C (v; k; t). In this paper, a computer search for nding good such covering designs, leading to new upper bounds on C (v; k; t), is considered. The search is facilitated by predetermining automorphisms of desired covering designs. A stochastic heuristic search (embedded in the gen...

متن کامل

Multimatroids I. Coverings by Independent Sets

Multimatroids are combinatorial structures that generalize matroids and arise in the study of Eulerian graphs. We prove, by means of an efficient algorithm, a covering theorem for multimatroids. This theorem extends Edmonds’ covering theorem for matroids. It also generalizes a theorem of Jackson on the Euler tours of a 4-regular graph.

متن کامل

Economical coverings of sets of lattice points

Let t(n, d) be the minimum number t such that there are t of the n lattice points {(x1, . . . , xd) : 1 ≤ xi ≤ n} so that the ( t 2 ) lines that they determine cover all the above n lattice points. We prove that for every integer d ≥ 2 there are two positive constants c1 = c1(d) and c2 = c2(d) such that for every n c1n d(d−1)/(2d−1) ≤ t(n, d) ≤ c2n log n. The special case d = 2 settles a proble...

متن کامل

Rough Sets, Coverings and Incomplete Information

Rough sets are often induced by descriptions of objects based on the precise observations of an insufficient number of attributes. In this paper, we study generalizations of rough sets to incomplete information systems, involving imprecise observations of attributes. The precise role of covering-based approximations of sets that extend the standard rough sets in the presence of incomplete infor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: MLQ

سال: 2010

ISSN: 0942-5616,1521-3870

DOI: 10.1002/malq.200910008